Biological Oxidation (Oppenheimer, C.; Stern, K. G.; Roman, W.)
نویسندگان
چکیده
منابع مشابه
Genetics: C. Stern
which involved various strains of race A and race B coming from diverse parts of the distribution area of each race. These races were of different "strength," and had different types of Y-chromosomes (Dobzhansky and Boche,6 Dobzhansky7). The details of chromosome morphology and chromosome differences between the two races of Drosophila pseudoobscura is now in press elsewhere., The present ident...
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملRoman k-Tuple Domination in Graphs
For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominatin...
متن کاملT C C C Beatcs No 109 S C: W M P G S?
The design of efficient algorithms for planar graphs, as a field of research, is over forty year old and continues to be an exciting area. There are several new efficient algorithms for a variety of graph optimization problems that exploit planarity and, in general, the structure of low genus graphs and graphs with excluded minors. Efficient space-bounded computations, on the other hand, involv...
متن کاملSigned total Roman k-domination in directed graphs
Let $D$ be a finite and simple digraph with vertex set $V(D)$.A signed total Roman $k$-dominating function (STR$k$DF) on$D$ is a function $f:V(D)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each$vin V(D)$, where $N^{-}(v)$ consists of all vertices of $D$ fromwhich arcs go into $v$, and (ii) every vertex $u$ for which$f(u)=-1$ has a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Education
سال: 1940
ISSN: 0021-9584,1938-1328
DOI: 10.1021/ed017p196.2